Bounded perturbation resilience of the viscosity algorithm
نویسندگان
چکیده
منابع مشابه
Nonlinear Viscosity Algorithm with Perturbation for Nonexpansive Multi-Valued Mappings
In this paper, based on viscosity technique with perturbation, we introduce a new non-linear viscosity algorithm for finding a element of the set of fixed points of nonexpansivemulti-valued mappings in a Hilbert space. We derive a strong convergence theorem for thisnew algorithm under appropriate assumptions. Moreover, in support of our results, somenumerical examples (u...
متن کاملBounded perturbation resilience of extragradient-type methods and their applications
In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces. This is an important property of algorithms which guarantees the convergence of the scheme under summable errors, meaning that an inexact version of the methods can also be considered. Moreover, once a...
متن کاملBounded perturbation resilience of projected scaled gradient methods
We investigate projected scaled gradient (PSG) methods for convex minimization problems. These methods perform a descent step along a diagonally scaled gradient direction followed by a feasibility regaining step via orthogonal projection onto the constraint set. This constitutes a generalized algorithmic structure that encompasses as special cases the gradient projection method, the projected N...
متن کاملClustering under Perturbation Resilience
Motivated by the fact that distances between data points in many real-world clustering instances are often based on heuristic measures, Bilu and Linial [6] proposed analyzing objective based clustering problems under the assumption that the optimum clustering to the objective is preserved under small multiplicative perturbations to distances between points. In this paper, we provide several res...
متن کاملMetric Perturbation Resilience
We study the notion of perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A clustering problem is α-perturbation resilient if the optimal clustering does not change when we perturb all distances by a factor of at most α. We consider a class of clustering problems with center-based objectives, which includes such problems as k-means, k-median, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2016
ISSN: 1029-242X
DOI: 10.1186/s13660-016-1242-6